Multiple-scale analysis for Painlevé transcendents with a large parameter
نویسندگان
چکیده
منابع مشابه
The Painlevé transcendents with solvable monodromy
We will study special solutions of the fourth, fifth and sixth Painlevé equations with generic values of parameters whose linear monodromy can be calculated explicitly. We will show the relation between Umemura’s classical solutions and our solutions.
متن کاملGrowth Models, Random Matrices and Painlevé Transcendents
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of the height of the polynuclear growth model, or the length of the longest increasing subsequence in a random permutation. The cumulative distribution of the lon...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملA Practical Desalinization Model for Large Scale Application
Salinity of soil and water is the most important agricultural hazard in arid and semi-aridregions. In saline soils, yield production directly influences by soluble salts in the root zone aswell as by shallow water table depth. The first step for reclamation of such soils is reducingsalinity to optimum level by leaching. The objective of this study was to develop a practicalmodel to estimate wat...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1997
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-39-1-11-17